I.—THE COMMENSURABILITY OF ALL VALUES

IThe theory of optimal reductions

We introduce a new class of higher order rewriting systems, called Interaction Systems (IS's). IS's come from Lafont's (Intuitionistic) Interaction Nets Lafont 1990] by dropping the linearity constraint. In particular, we borrow from Interaction Nets the syntactical bipartitions of operators into constructors and destructors and the principle of binary interaction. As a consequence, IS's are a ...

Squarefree Values of Polynomials All

Commensurability Classes of Twist Knots

In this paper we prove that if MK is the complement of a non-fibered twist knot K in S, then MK is not commensurable to a fibered knot complement in a Z/2Z-homology sphere. To prove this result we derive a recursive description of the character variety of twist knots and then prove that a commensurability criterion developed by D. Calegari and N. Dunfield is satisfied for these varieties. In ad...

IThe Visual Display of ~ Parallel Performance ~ Data

( performance models. T he primary motivation for using parallel computer systems is their high performance potential, but that potential is notoriously difficult to realize, and users often must analyze and tune parallel program performance. Parallel systems can be instrumented to provide ample feedback on program behavior, but because of the volume and complexity of the resulting performance ...

IThe Development of Traffic Engineering in Australia

M cars first appeared on Australian roads in about 1900, and road laws, as they are known today, began to evolve soon after. For several years traffic control in Australia was largely a police responsibility, but by the mid to late 1930sthe principles of traffic engineering, including the need to consider the road, the vehicle, the driver, and the traffic rules as an integrated system, were bei...